analyz track weblog commun discrimin collect repres logic queri view decid express cluster comparison measur densiti profil applic discoveri altern cluster mine diseas state convert medic intervent diseas contrast pattern base cluster qualiti index categor data applic emerg pattern microarrai gene express data analysi increment comput queri growth web rapid increas number user access onlin databas detail knowledg schema queri languag simpl queri languag design expert complic describ bank system enabl keyword base search relat databas data schema brows bank enabl user extract inform simpl manner knowledg schema write complex queri user inform type keyword hyperlink interact control displai result bank model tupl node graph connect link induc foreign kei relationship answer queri model root tree connect tupl match individu keyword queri answer rank notion proxim coupl notion prestig node base inlink similar techniqu develop web search present effici heurist algorithm find rank queri result emerg pattern base classif emerg pattern abstract emerg pattern ep associ featur frequenc increas significantli class proven build power classifi establish diagnosi huge search space mine repres ep hard task larg dataset recent result condens represent frequent close pattern propos exact condens represent ep give method provid ep highest growth rate call strong emerg pattern sep collabor philip compani experi show interest sep introduct character class classif signific field researchin data mine machin learn initi introduc emerg pattern ep pattern frequenc strongli vari data set class ep character class quantit qualit capac emphas distinct class ep enabl build classifi propos diagnosi mine ep larg dataset remain challeng highnumb candid pattern paper propos contribut effici extract ofemerg pattern origin approach advantag recent progress condens represent close pattern firstli propos exact condens represent emerg pattern dataset contrari border approach section epswith lower bound growth rate condens represent easili enabl exact growth rate emerg pattern wepropos method easili provid emerg pattern growth rate call amp quot strong emerg pattern amp quot work justifi byrequest provid data collabor philip compani notic practic high number ep strong emerg patternsar bring synthet exploit result evalu inter dlaboratori cross dplatform concord dna microarrai discrimin gene classifi transfer mine sequenc classifi earli predict supervis learn sequenc data sequenc classif recogn import data mine task signific applic tempor order import sequenc data critic applic sequenc classif medic diagnosi disast predict earli predict highli desir featur sequenc classifi earli predict sequenc classifi prefix sequenc short make accur predict knowledg earli predict sequenc data studi systemat paper identifi problem mine sequenc classifi earli predict analyz problem challeng attempt tackl problem propos interest method sequenti classif rule scr method mine set sequenti classif rule classifi call earli predict util defin select featur rule gener sequenti decis tree gsdt method adopt divid conquer strategi gener classif model conduct extens empir evalu real data set interestingli method achiev accuraci compar stateof art method typic short prefix sequenc result earli predict highli feasibl effect substructur similar measur chines recip logic queri view decid express semant knowledg facil web dbase recip databas system support person advanc data web manag evolut mainten frequent pattern space transact remov abstract paper address mainten discov frequent pattern batch transact remov origin dataset conduct depth investig frequent pattern space evolv transact remov updat concept equival class inspir evolut analysi effect exact algorithm trum propos maintain frequent pattern trum maintain frequent pattern effici updat affect equival class experiment result demonstr algorithm outperform repres state art algorithm effici comput iceberg cube bound aggreg function mine minim distinguish subsequ pattern gap constraint discov contrast collect data import task data mine paper introduc type contrast pattern call minim distinguish subsequ md md minim subsequ occur frequent class sequenc infrequ sequenc class natur repres strong succinct contrast inform sequenti dataset applic protein comparison document comparison build sequenti classif model mine md pattern challeng task significantli mine contrast relat transact data import type constraint integr mine process maximum gap constraint present effici algorithm call consgapmin mine mdss maximum gap constraint emploi highli effici bitset boolean oper power gap base prune prefix growth framework perform evalu spars dens dataset demonstr scalabl consgapmin show abil mine pattern high dimension dataset low support minimum descript length principl gener prefer close pattern cluster similar comparison densiti profil paper propos method compar cluster partition geometr approach motiv observ vast major previou techniqu compar cluster partit examin assign point set theoret term partit method ignor spatial layout data disregard fact inform respons gener cluster begin demonstr lead varieti failur mode previou comparison techniqu fail differenti signific made data cluster formul measur compar cluster combin spatial partit inform singl measur optim theori elimin patholog condit previou approach simultan remov common limit cluster number cluster ident dataset approach stabl easili implement strong intuit appeal spatial properti cluster membership assign view cluster partit set point locat space distanc function view natur popular cluster algorithm mean spectral cluster affin propag input collect point cluster distanc function space point lie distanc function implicitli transform kernel defin properti crucial cluster algorithm output contrast exist cluster comparison techniqu ignor distanc point treat cluster partit disembodi atom approach merit circumst surpris ignor distanc func cluster similar comparison densiti profil paper propos method compar cluster partition geometr approach motiv observ vast major previou techniqu compar cluster partit examin assign point set theoret term partit method ignor spatial layout data disregard fact inform respons gener cluster begin demonstr lead varieti failur mode previou comparison techniqu fail differenti signific made data cluster formul measur compar cluster combin spatial partit inform singl measur optim theori elimin patholog condit previou approach simultan remov common limit cluster number cluster ident dataset approach stabl easili implement strong intuit appeal spatial properti cluster membership assign view cluster partit set point locat space distanc function view natur popular cluster algorithm mean spectral cluster affin propag input collect point cluster distanc function space point lie distanc function implicitli transform kernel defin properti crucial cluster algorithm output contrast exist cluster comparison techniqu ignor distanc point treat cluster partit disembodi atom approach merit circumst surpris ignor distanc func succinct inform cluster descript document repositori regress cube lossless compress aggreg abstract olap engin wide support multidimension data analysi desir support data cube advanc statist measur regress filter addit tradit simpl measur count averag measur user model smooth predict trend pattern data exist algorithm simpl distribut algebra measur inadequ effici comput statist measur multidimension space paper propos fundament class measur compress measur order support effici comput statist model compress measur compress cell auxiliari matrix size independ number tupl comput statist measur data cell compress data lower level cell access raw data time space effici lossless aggreg formula deriv regress filter measur analyt experiment studi show result system regress cube substanti reduc memori usag respons time statist analysi multidimension data index term aggreg compress data cube olap mine succinct system minim gener formal concept abstract formal concept analysi activ field studi data analysi knowledg discoveri formal concept determin extent set object fall intent set properti attribut cover intent call close itemset maximum set attribut character minim gener minim subset intent similarli character paper introduc succinct system minim gener ssmg minim represent minim gener concept effici algorithm mine ssmg ssmg reveal equival relationship minim gener import medic scientif discoveri reveal extent base semant equival associ ssmg losslessli reduc size represent minim gener similar close itemset losslessli reduc size represent frequent itemset remov redud human user grasp structur inform concept mine minim distinguish subsequ pattern gap constraint discov contrast collect data import task data mine paper introduc type contrast pattern call minim distinguish subsequ md md minim subsequ occur frequent class sequenc infrequ sequenc class natur repres strong succinct contrast inform sequenti dataset applic protein comparison document comparison build sequenti classif model mine md pattern challeng task significantli mine contrast relat transact data import type constraint integr mine process maximum gap constraint present effici algorithm call consgapmin mine mdss maximum gap constraint emploi highli effici bitset boolean oper power gap base prune prefix growth framework perform evalu spars dens dataset demonstr scalabl consgapmin show abil mine pattern high dimension dataset low support integr privat databas data analysi abstract todai global network societi dual demand inform share inform protect typic scenario parti integr privat databas achiev common goal benefici provid privaci requir satisfi paper goal build classifi integr data satisfi anonym privaci requir anonym requir state domain valu gener attribut identifi record gener process leak specif inform final integr data present practic effici solut problem integr privat databas data analysi abstract todai global network societi dual demand inform share inform protect typic scenario parti integr privat databas achiev common goal benefici provid privaci requir satisfi paper goal build classifi integr data satisfi anonym privaci requir anonym requir state domain valu gener attribut identifi record gener process leak specif inform final integr data present practic effici solut problem stream cube architectur multi ddimension analysi data stream divid dand dapproxim constraint push strategi iceberg cube mine mine border descript emerg pattern dataset pair complex find emerg pattern complex find emerg pattern increment mainten border space emerg pattern mine constrain gradient larg databas data analysi task view search mine multidimension space md mdss dimens captur potenti import factor applic cell repres combin valu factor systemat analyz data md terest notion call cubegrad recent introduc imielinski al ika focus notabl measur md compar cell refer probe cell gradient cell ancestor descend sibl call queri gradient analysi queri gq md billion cell import answer gq effici studi focu develop effici method mine gq constrain weakli anti monoton constraint conduct independ gradient cell search probe cell ineffici due repeat work propos effici algorithm liveset driven algorithm find good gradient probe cell pair search pass util measur analysi dimens match analysi set orient manner achiev bi direct prune set hope probe cell hope gradient cell adopt hyper tree structur cube deep instanc dbase lazi discoveri classif system push aggreg constraint divid dand dapproxim iceberg cube mine comput group partit group dimens list satisfi aggreg constraint previou work push anti monoton constraint iceberg cube mine constraint anti monoton paper propos strategi push gener aggreg constraint call divid approxim strategi divid search space approxim constraint subspac pushabl constraint strategi recurs appli approxim approach constraint prune tight show constraint defin sql aggreg arithmet oper comparison oper push divideand approxim present effici implement import subclass evalu synthet real life databas decid termin problem activ databas system advanc web dage inform manag push aggreg constraint divid dand dapproxim iceberg cube mine comput group partit group dimens list satisfi aggreg constraint previou work push anti monoton constraint iceberg cube mine constraint anti monoton paper propos strategi push gener aggreg constraint call divid approxim strategi divid search space approxim constraint subspac pushabl constraint strategi recurs appli approxim approach constraint prune tight show constraint defin sql aggreg arithmet oper comparison oper push divideand approxim present effici implement import subclass evalu synthet real life databas increment recomput local languag studi problem maintain recurs dene view transit closur relat tradit relat languag recurs mechan main result paper neg show properti queri languag impli imposs increment mainten properti local queri hold relat calculu extens includ group aggreg construct essenti plain sql onlin analyt process stream data feasibl real time surveil system dynam environ ment gener tremend potenti infinit vol um stream data volum huge scan multipl time data resid low level abstract analyst interest dynam trend outlier high level abstract discov high level characterist perform line multi level analysi stream data similar olap line analyt process relat data warehous data comput condens frequent pattern base frequent pattern mine studi extens effect effici mine limit number frequent pattern gener larg applic suffici gener examin frequent pattern support frequenc close approxim full precis compact close frequent pattern base call condens frequent pattern base cubeexplor onlin explor data cube multi ddimension regress analysi time dseri data stream real time product system dynam environ gener tremend potenti infinit amount stream data volum data huge store disk scan multipl time perform line multi dimension analysi data mine data alert peopl dramat situat initi time high qualiti respons challeng task paper effici mine nich set routin abstract wide recogn success busi fall set routin limit past remain success discov opportun nich nich surpris rule contradict set routin captur signific repres client sector deserv profit treatment strong rule except pair paper studi effici mine set routin nich introduc semant approach select set repres pattern present effici increment algorithm implement approach combin strength pattern frequenc distanc classif predict perform train instanc provid intens studi machin learn pattern recognit commun long period time instanc base induct contrast eager learn base classif exemplifi import approach classif typic instanc base induct algorithm nearest neighbour nn rule test instanc databas train instanc nn rule find train instanc nearest kind distanc choos class label prevail train instanc build behaviour knowledg space make classif decis make express jump emerg pattern classif classif aim discov model train data predict class test instanc paper propos jump emerg pattern jep basi classifi call jep classifi jep captur crucial differ pair dataset aggreg jep larg support produc potent classif power procedur jep classifi learn pair wise featur set jep contain train data collect impact contribut express pair wise featur determin class label test data express jep jep classifi strengthen resist nois train data reduc complex larg number jep algorithm construct jep classifi scalabl effici algorithm make border effici comput iceberg cube complex measur expens comput materi complet high dimension data cube comput iceberg cube aggreg threshold effect deriv nontrivi multidimension aggreg olap data mine paper studi effici method comput iceberg cube popularli complex measur averag develop methodolog adopt weaker anti monoton condit test prune search space effici comput iceberg cube averag measur propos top averag prune method extend previous studi method apriori buc top apriori top buc improv perform interest hypertre structur call tree design iceberg cube method call top cube develop perform studi show top buc top cube promis candid scalabl comput top cube perform case mine multi ddimension constrain gradient data cube introduct recent year grow interest multi dimension analysi relat databas transact make express jump emerg pattern classif classif aim discov model train data predict class test instanc paper propos jump emerg pattern jep basi classifi call jep classifi jep captur crucial differ pair dataset aggreg jep larg support produc potent classif power procedur jep classifi learn pair wise featur set jep contain train data collect impact contribut express pair wise featur determin class label test data express jep jep classifi strengthen resist nois train data reduc complex larg number jep algorithm construct jep classifi scalabl effici algorithm make border emerg pattern classif optim techniqu data dintens decis flow space jump emerg pattern increment mainten algorithm concept jump emerg pattern jep propos describ discrimin featur occur posit train instanc occur neg class jep construct classifi gener provid accuraci state art classifi algorithm maintain space jump emerg pattern jep space present paper prove jep space satisfi properti convex jep space concis repres bound consist gener element specif element respons insert train instanc jep space modifi oper boundari element boundari element jep space instanc strategi complet avoid back initi step build jep space addit inform dbase classif aggreg emerg pattern abstract emerg pattern ep knowledg pattern captur contrast data class paper propos informationbas approach classif aggreg emerg pattern constraint base ep mine algorithm enabl system learn larg volum high dimension data approach select repres ep effici algorithm find ep render system high predict accuraci short classif time experi benchmark dataset show result classifi good predict accuraci superior state art classif system cba lb explor constraint effici mine emerg pattern larg high ddimension dataset emerg pattern ep propos recent captur differ dataset ep multivari featur support increas sharpli background dataset target dataset support ratio call growth rate interest long ep low support mine ep high dimension dataset great challeng due combinatori explos number candid propos constraint base ep miner consepmin util type constraint effect prune search space extern constraint user minimum support growth rate growth rate improv con ne result ep set inher constraint subset support top growth rate origin deriv properti ep dataset sole prune search space save comput consepmin effici mine ep low support larg high dimension dataset low minim make express jump emerg pattern classif classif aim discov model train data predict class test instanc paper propos jump emerg pattern jep basi classifi call jep classifi jep captur crucial differ pair dataset aggreg jep larg support produc potent classif power procedur jep classifi learn pair wise featur set jep contain train data collect impact contribut express pair wise featur determin class label test data express jep jep classifi strengthen resist nois train data reduc complex larg number jep algorithm construct jep classifi scalabl effici algorithm make border instanc dbase classif emerg pattern emerg pattern ep itemset support chang significantli class captur discrimin featur sharpli contrast instanc class recent ep base classifi propos mine ep call eager learn train data aggreg discrimin power mine ep classifi instanc propos instanc base classifi ep call deep achiev accuraci effici previous propos ep base classifi high accuraci achiev instanc base approach enabl deep pinpoint ep relev test instanc miss eager learn approach high effici obtain seri data reduct concis data represent techniqu experi show deep decis time linearli scalabl number train instanc separ auxiliari ariti hierarchi dorder increment evalu system dari input relat increment mainten recurs view relat calculu fsql view central compon tradit databas system applic data warehous desir view transit closur defin standard languag underli databas system fortu nate increment maintain view standard languag exam ple transit closur acycl graph undi rect graph maintain relat cal culu singl edg insert delet result publish theoret ical databas commun purpos survei make result wider databas research develop commun interest issu involv mainten recurs view mainten al gorithm applic view class view view definit languag datalog mainten algorithm mainten languag pressiv conjunct queri lation calculu sql ideal mainten languag expens view def init languag mainten algorithm updat kind singl tu ple insert singl tupl delet special set base insert delet combin thereof view mainten algorithm maintain auxiliari relat maintain view interest interest minim ariti auxiliari relat local properti queri languag express databas queri languag remain major motiv research finit model theori techniqu finit model theori base ehrenfeucht fraiss game applic involv intric argument tool appli order logic extens languag resembl real queri languag sql paper local analyz express queri languag queri local determin tupl belong output predetermin portion input studi local properti queri context pure order case appli result tool analyz express power sql languag prove gener result describ output local queri lead easi inexpress proof close relat bound degre properti framework optim distribut workflow execut central problem workflow concern optim distribut work workflow execut task manag task distribut multipl process node comput case task manag execut process node limit function reason optim translat workflow schema flowchart execut restrict environ script languag flowchart base workflow engin paper present framework optim physic distribut workflow schema map workflow schema flowchart provid gener model repres essenti distribut workflow schema repres broad varieti execut strategi model base famili commun flowchart cf framework workflow schema rewritten famili cf whi effici mine partial period pattern time seri databas partial period search search partial period pattern time seri databas interest data mine problem previou studi period search find full period pattern point time contribut precis approxim period partial period common practic time episod exhibit period pattern present algorithm effici mine partial period pattern explor interest properti relat partial period apriori properti max subpattern hit set properti share mine multipl period max subpattern hit set properti vital properti deriv count frequent pattern small subset pattern exist time seri show mine partial period scan time seri databas mine multipl period perform studi show propos method effici mine long period pattern data integr describ sourc constraint databas increment fo databas provid main concret scenario finitemodel theori comput scienc paper present inform overview databas theori aim finit model theorist emphas specif databas area argu area databas rich sourc question vital finit model theori decid dorder logic queri view studi problem decid satisfi order logic queri view aim delimit boundari decid undecid fragment languag view occupi central place databas research due role applic inform integr data wareh princip result identif import decid class queri unari conjunct view extend decid classic class order sentenc unari relat lowenheim class demonstr extend class lead undecid addit area work relev extens result relat problem queri contain trigger termin implic depend reason descript logic kei word satisfi decid order logic databas queri databas view conjunct queri unari view in effici mine emerg pattern discov trend differ introduc kind pattern call emerg pattern ep knowledg discoveri databas ep defin itemset support increas significantli dataset ep captur emerg trend timestamp databas contrast data class ep proven build power classifi accur cba dataset ep low medium support give insight guidanc expert understood applic effici mine ep challeng problem apriori properti longer hold ep ii candid high dimension databas small support threshold naiv algorithm costli solv problem promot descript larg collect itemset concis border pa effici mine high confidi associ rule support threshold declar workflow support easi modif dynam brows interesting discov associ rule term neighborhood dbase unexpected central problem knowledg discoveri develop good measur interesting discov pattern measur user manual examin interest rule larg number mine rule previou propos measur includ rule templat minim rule cover action unexpected statist sens user belief paper introduc neighborhood base interesting unexpected term neighborhood base paramet present notion distanc rule neighborhood rule neighborhood base interesting rule defin term pattern fluctuat confid densiti mine rule neighborhood interesting defin set rule plateau ridg neighborhood properti decid undecid result termin problem activ databas rule activ databas system enhanc function tradit databas activ rule trigger princip question system termin rule recurs activ indefinit initi trigger event paper studi decid termin problem aim delimit boundari decid undecid present famili rule languag liter languag updat permit atom bodi unari languag unari relat updat higher ariti relat access view identifi member close boundari decid context similar queri languag dynam interest contrast datalog negat result shed insight power trigger comparison termin problem bounded queri contain increment view mainten base relat tag distribut databas increment view mainten problem deal effici updat materi view respons updat base relat paper consid problem distribut databas environ commun cost minim primari object view consid defin base relat join oper approach tag auxiliari data tupl base relat tupl particip join tag avoid send irrelev data network reduc commun cost basic view mainten algorithm propos tag addit reduc commun cost import featur basic algorithm deriv exact chang view view featur maintain aggreg view materi view featur applic relat express power constraint queri languag express power order queri languag class equal inequ constraint studi paper settl conjectur recurs queri pariti test transit closur express relat calculu augment polynomi inequ constraint real note relat queri exhibit form gener establish number collaps result form class gener boolean queri express relat calculu augment class constraint coincid class queri express relat calculu order relat prove result natur activ domain semant consequ relat calculu augment polynomi inequ express class gener boolean queri natur activ domain semant prove ariti bound dorder increment evalu definit polynomi time databas queri maintain constrain transit closur conjunct queri local properti queri languag express databas queri languag remain major motiv research finit model theori techniqu finit model theori base ehrenfeucht fraiss game applic involv intric argument tool appli order logic extens languag resembl real queri languag sql paper local analyz express queri languag queri local determin tupl belong output predetermin portion input studi local properti queri context pure order case appli result tool analyz express power sql languag prove gener result describ output local queri lead easi inexpress proof close relat bound degre properti structur issu activ rule system activ databas system enhanc function tradit databas activ rule trigger consensu compon includ rule system paper express power simpl activ databas rule system examin effect choos featur studi import paramet variat present rule languag extern queri languag meta rule languag pend rule structur show highli influenti determin express rule system appreci serv basi understand broader pictur system behaviour determinist foi strictli weaker relationship foi ariti hierarchi maintain transit closur order node dset edg dset delet algorithm adapt materialis view data warehous paper problem materialis view adapt data warehous materialis view import data wareh speed queri process larg amount data user requir chang time chang definit view dynam situat question aris materialis view recomput scratch chang definit obtain adapt materialis view view definit expens view recomput scratch worthwhil examin wai perform materialis view recomput entir view undergon chang definit present adapt algorithm adapt view made select claus main idea algorithm augment schema base relat ad joincount attribut relat express power constraint queri languag express power order queri languag class equal inequ constraint studi paper settl conjectur recurs queri pariti test transit closur express relat calculu augment polynomi inequ constraint real note relat queri exhibit form gener establish number collaps result form class gener boolean queri express relat calculu augment class constraint coincid class queri express relat calculu order relat prove result natur activ domain semant consequ relat calculu augment polynomi inequ express class gener boolean queri natur activ domain semant prove conjunct queri contain respect view constraint imposs decrement recomput recurs queri relat calculu sql studi problem maintain recurs defin view transit closur relat tradit relat languag recurs mechan show transit closur maintain relat calculu delet edg proof techniqu show result proof techniqu gener languag languag nest relat number aggreg function languag consid paper theoret reconstruct sql proof techniqu gener recurs queri show number recurs queri maintain sql languag show continu true presenc auxiliari relat relat complex updat transit closur updat gener queri show strictli harder increment bounded nonrecurs increment evalu datalog queri abstract recurs datalog queri nonrecurs increment evalu approach nonrecurs datalog program comput differ answer queri success databas updat mechan approach call order increment evalu system foi show larg class datalog queri call gener weakli regular queri foi exist defin increment bounded variat gener bounded increment bound queri shown foi form relat increment bounded structur recurs propos bulk data type character increment boundednessus insert idempot insert commut determin properti structur recurs final show increment bounded notion undecid decid suffici condit space dbound foi nonrecurs increment evalu datalog queri problem repeatedli evalu computation expens queri databas updat success queri request situat differ success databas state answer queri state reduc cost evalu queri state nonrecurs datalog union conjunct queri comput differ call process increment queri evalu conjunct queri formal notion increment queri evalu conjunct queri give algorithm construct regular chain queri includ transit closur special case nonrecurs datalog program comput differ answer updat answer updat extend result weakli regular queri regular chain program augment conjunct queri havin increment decrement evalu transit closur dorder queri index posit program formal languag decomposit chain datalog program left linear drule compon framework object migrat object dorient databas dorder increment evalu datalog queri problem repeatedli evalu computation expens queri databas updat success queri request situat differ success databas state answer queri state reduc cost evalu queri state order queri comput differ call process order increment queri evalu formal notion order increment queri evalu give algorithm construct regular chain queri includ transit closur special case nonrecurs program comput differ answer updat answer updat extend result weakli regular queri regular chain program augment conjunct queri call cartesian close increment properti case unbound monoton ldl logic program set represent translat queri heterogen databas schemat discrep discuss report object migrat classif increment evalu datalog queri problem repeatedli evalu computation expens queri databas updat success queri request situat differ success databas state answer queri state reduc cost evalu queri state nonrecurs datalog union conjunct queri comput differ call process increment queri evalu conjunct queri formal notion increment queri evalu conjunct queri give algorithm construct regular chain queri includ transit closur special case nonrecurs datalog program comput differ answer updat answer updat extend result weakli regular queri regular chain program augment conjunct queri havin datalog express chain queri grammar tool character datalog linear chain queri object behavior script specul possibl realiz idea threedimension cyberspac sketch novel william gibson todai technolog virtual realiti global network internet provid fundament effort examin technolog principl gibsonian virtual environ conclud properti implement implement system properti face number problem larg small semant virtual environ inhabit defin report ongo implement prototyp softwar system design evalu feasibl idea introduct famou neuromanc gib william gibson present idea cyberspac sensual represent global network databas present user directli brain stimula monoton ldl logic program set localiz constraint object histori decomposit datalog program map distribut process datalog queri decompos databas composit decomposit datalog program map localiz constraint object histori 